An efficient algorithm for a generalized joint replenishment problem

نویسندگان

  • J. B. G. Frenk
  • M. J. Kleijn
  • Rommert Dekker
چکیده

In most multi-item inventory systems, the ordering costs consist of a major cost and a minor cost for each item included. Applying for every individual item a cyclic inventory policy, where the cycle length is a multiple of some basic cycle time, reduces the major ordering costs. An e cient algorithm to determine the optimal policy of this type is discussed in this paper. It is shown that this algorithm can be used for deterministic multi-item inventory problems, with general cost rate functions and possibly service level constraints, of which the well-known joint replenishment problem is a special case. Some useful results in determining the optimal control parameters are derived, and worked out for piecewise linear cost rate functions. Numerical results for this case show that the algorithm signi cantly outperforms other solution methods, both in the quality of the solution as in the running time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Presenting a Joint Replenishment-location Model Under all-units Quantity Discount and Solving by Genetic Algorithm and Harmony Search Algorithm

In this paper a model is proposed for distribution centers location and joint replenishment of a distribution system that is responsible for orders and product delivery to distribution centers. This distribution centers are under limitedwarehouse space and this can determine amount of requirement product by considering proposed discount.The proposed model is develop to minimize total costs cons...

متن کامل

Joint pricing, inventory, and preservation decisions for deteriorating items with stochastic demand and promotional efforts

This study models a joint pricing, inventory, and preservation decision-making problem for deteriorating items subject to stochastic demand and promotional effort. The generalized price-dependent stochastic demand, time proportional deterioration, and partial backlogging rates are used to model the inventory system. The objective is to find the optimal pricing, replenishment, and preservation t...

متن کامل

On the efficiency of optimal algorithms for the joint replenishment problem: a comparative study

In this paper we proposed an efficient algorithm to solve the joint replenishment problem to optimality. We perform a computational study to compare the performance of the proposed algorithm with the best one reported in Viswanathan [6]. The study reveals that for large minor set-up costs and moderate major set-up cost, our algorithm outperforms the latter.

متن کامل

An efficient optimal solution method for the joint replenishment problem with minimum order quantities

We study the joint replenishment problem (JRP) for M items under deterministic demand, with a minimum order quantity constraint for each item in the replenishment order. We first study an iterative procedure that proves to be not efficient in this case. Further, we derive bounds on the basic cycle time and propose an efficient global optimisation procedure to solve the JRP with constraints. Mor...

متن کامل

Optimal ordering quantities for substitutable deteriorating items under joint replenishment with cost of substitution

In this paper we develop an inventory model, to determine the optimal ordering quantities, for a set of two substitutable deteriorating items. In this inventory model the inventory level of both items depleted due to demands and deterioration and when an item is out of stock, its demands are partially fulfilled by the other item and all unsatisfied demand is lost. Each substituted item incurs a...

متن کامل

A Node-based Mathematical Model towards the Location Routing Problem with Intermediate Replenishment Facilities under Capacity Constraint

In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • European Journal of Operational Research

دوره 118  شماره 

صفحات  -

تاریخ انتشار 1999